Scheduling and Data Distribution in a Multiprocessor Video Server
نویسنده
چکیده
A. L. Narasimha Reddy IBM Almaden Research Center 650 Harry Road San Jose, CA 95120. [email protected] Abstract In this paper, we will address the problem of distributing and scheduling movies on a multiprocessor video server. We will also address the issue of scheduling communication over the multiprocessor switch for the playback of the scheduled movies. A solution is proposed in this paper that addresses these three issues at once. The proposed solution minimizes contention for links over the switch. The proposed solution makes movie scheduling very simple if the rst block of the movie is scheduled, the rest of the movie is automatically scheduled. Moreover, if the rst block of the movie stream is scheduled without network contention, the proposed solution guarantees that there will be no network contention during the entire duration of playback of that movie.
منابع مشابه
A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملScheduling in Multimedia Systems
In video-on-demand multimedia systems, the data has to be delivered to the consumer at regular intervals to deliver smooth playback of video streams. A video-on-demand server has to schedule the service of individual streams to ensure such a smooth delivery of video data. We will present scheduling solutions for individual components of service in a multiprocessor based video server.
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملScheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms
This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...
متن کامل